A contribution to scheduling jobs submitted by finite-sources in computational clusters
نویسندگان
چکیده
Data science and data processing are very popular topics nowadays. Un- like a few years ago, everything is connected to now we have handle these kinds of large well. Therefore the distributed heterogeneous resources networks e.g. computational grid, attracted great interest. It has become challenge schedule jobs in order utilize available effectively. The allocation arriving impact on efficiency energy consumption system. A generalized finite source model presented this paper. Our main goal build up models for performance evaluation scheduling computeintensive with unknown service times cluster that consists servers different types. For purpose determine various measures all combinations three policies (two them novelty paper: MRT MRTHP policies) which can be used assigning schemes buffering jobs. Furthermore, investigate effect switching off idle system under schemes. Computational results obtained by simulation show choice policy scheme plays an important role ensuring quality parameters such as waiting time response experienced case However, only affected saving mode, while does not significant impact.
منابع مشابه
Scheduling MapReduce Jobs in HPC Clusters
MapReduce (MR) has become a de facto standard for largescale data analysis. Moreover, it has also attracted the attention of the HPC community due to its simplicity, efficiency and highly scalable parallel model. However, MR implementations present some issues that may complicate its execution in existing HPC clusters, specially concerning the job submission. While on MR there are no strict par...
متن کاملA Hyper-Heuristic for Scheduling Independent Jobs in Computational Grids
In this paper we present the design and implementation of an hyper-heuristic for efficiently scheduling independent jobs in Computational Grids. An efficient scheduling of jobs to Grid resources depends on many parameters, among others, the characteristics of the Grid infrastructure and job characteristics (such as computing capacity, consistency of computing, etc.). Existing ad hoc scheduling ...
متن کاملSelective Buddy Allocation for Scheduling Parallel Jobs on Clusters
In this paper, we evaluate the performance implications of using a buddy scheme for contiguous node allocation, in conjunction with a backfilling job scheduler for clusters. When a contiguous node allocation strategy is used, there is a trade-off between improved run-time of jobs (due to reduced link contention and lower communication overhead) and increased wait-time of jobs (due to external f...
متن کاملScheduling File Transfers for Data-Intensive Jobs on Heterogeneous Clusters
This paper addresses the problem of efficient collective scheduling of file transfers requested by a batch of tasks. Our work targets a heterogeneous collection of storage and compute clusters. The goal is to minimize the overall time to transfer files to their respective destination nodes. Two scheduling schemes are proposed and experimentally evaluated against an existing approach, the Insert...
متن کاملImproved approximation algorithms for scheduling parallel jobs on identical clusters
The Multiple Cluster Scheduling Problem corresponds to minimize the maximum completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted to N identical clusters. It cannot be approximated with a ratio better than 2 (unless P = NP). We present in this paper the methodology that encompasses several existing results [1, 2]. We detail first how to apply it for obtaini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Az Eszterházy Károly Tanárképz? F?iskola tudományos közleményei
سال: 2021
ISSN: ['1216-6014', '1787-6117', '1787-5021', '1589-6498']
DOI: https://doi.org/10.33039/ami.2021.03.008